Algebraic diagonals and walks: Algorithms, bounds, complexity
نویسندگان
چکیده
منابع مشابه
Algebraic Diagonals and Walks: Algorithms, Bounds, Complexity
The diagonal of a multivariate power series F is the univariate power series Diag F generated by the diagonal terms of F . Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and enumerative combinatorics. We study algorithmic questions related to diagonals in the case where F is the Taylor expansion of a bivariate rational function. It...
متن کاملProof Complexity Lower Bounds from Algebraic Circuit Complexity
We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi [GP14], where the circuits comprising the proof come from various restricted algebraic circuit classes. This mimics an established research direction in the boolean setting for subsystems of Extended Frege proofs, where proof-lines are ci...
متن کاملConnecting SAT Algorithms and Complexity Lower Bounds
I will describe prior and current work on connecting the art of finding good satisfiability algorithms with the art of proving complexity lower bounds: proofs of limitations on what problems can be solved by good algorithms. Surprisingly, even minor algorithmic progress on solving the circuit satisfiability problem faster than exhaustive search can be applied to prove strong circuit complexity ...
متن کاملConcurrent Computation and Time Complexity Bounds for Algebraic Fractals
This paper considers various parallelization schemes and applies them to concurrent computation of algebraic fractals on IBM SP3 and SGI Onyx 3400 systems. We adapt the time complexity bounds of parallel Monte Carlo methods to predict the execution time behavior of these schemes. Nous étudions plusieurs méthodes de parallélisation appliquées au calcul simultané de plusieurs objets fractals algé...
متن کاملComplexity Analysis of Algorithms in Algebraic Computation
Numerical computations with real algebraic numbers require algorithms for approximating and isolating real roots of polynomials. A classical choice for root approximation is Newton’s method. For an analytic function on a Banach space, Smale introduced the concept of approximate zeros, i.e., points from which Newton’s method for the function converges quadratically. To identify these approximate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2017
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2016.11.006